Search for: All records

Supersolvable hyperplane arrangements and matroids are known to give rise to certain Koszul algebras, namely their Orlik–Solomon algebras and graded Varchenko–Gel’fand algebras. We explore how this interacts with group actions, particularly for the braid arrangement and the action of the symmetric group, where the Hilbert functions of the algebras and their Koszul duals are given by Stirling numbers of the first and second kinds, respectively. The corresponding symmetric group representations exhibit branching rules that interpret Stirling number recurrences, which are shown to apply to all supersolvable arrangements. They also enjoy representation stability properties that follow from Koszul duality. 

Abstract In this paper, we give Pieri rules for skew dual immaculate functions and their recently discovered row-strict counterparts. We establish our rules using a right-action analogue of the skew Littlewood–Richardson rule for Hopf algebras of Lam–Lauve–Sottile. We also obtain Pieri rules for row-strict (dual) immaculate functions. 

We introduce a new basis of quasisymmetric functions, the row-strict dual immaculate functions. We construct a cyclic, indecomposable 0-Hecke algebra module for these functions. Our row-strict immaculate functions are related to the dual immaculate functions of Berg-Bergeron-Saliola-Serrano-Zabrocki (2014-15) by the involution $\mathrm{\psi <\#comment/>}$on the ring $\mathrm{QSym}$of quasisymmetric functions. We give an explicit description of the effect of $\mathrm{\psi <\#comment/>}$on the associated 0-Hecke modules, via the poset induced by the 0-Hecke action on standard immaculate tableaux. This remarkable poset reveals other 0-Hecke submodules and quotient modules, often cyclic and indecomposable, notably for a row-strict analogue of the extended Schur functions studied in Assaf-Searles (2019). Like the dual immaculate function, the row-strict dual immaculate function is the generating function of a suitable set of tableaux, corresponding to a specific descent set. We give a complete combinatorial and representation-theoretic picture by constructing 0-Hecke modules for the remaining variations on descent sets, and showing thatallthe possible variations for generating functions of tableaux occur as characteristics of the 0-Hecke modules determined by these descent sets.